On the Gaps in the Set of Exponents of Boolean Primitive Circulant
نویسندگان
چکیده
In this paper we consider the problem of describing the possible exponents of boolean primitive circulant matrices. We give a conjecture for the possible such exponents and prove this conjecture in several cases. In particular, we consider in greater detail the case of matrices whose generating vector has three nonzero entries.
منابع مشابه
Distribution of the exponents of primitive circulant matrices in the first four boxes of Zn
In this paper we consider the problem of describing the possible exponents of n-by-n Boolean primitive circulant matrices. It is well known that this set is a subset of [1, n− 1] and not all integers in [1, n− 1] are attainable exponents. In the literature, some attention has been paid to the gaps in the set of exponents. The first three gaps have been proven, that is, the integers in the inter...
متن کاملThe Structure of the Exponent Set for Finite Cyclic Groups
We survey properties of the set of possible exponents of subsets of Zn (equivalently, exponents of primitive circulant digraphs on n vertices). Let En denote this exponent set. We point out that En contains the positive integers up to √ n, the ‘large’ exponents ⌊ 3 ⌋+1, ⌊ 2 ⌋, n−1, and for even n ≥ 4, the additional value n 2 −1. It is easy to see that no exponent in [n 2 +1, n−2] is possible, ...
متن کاملMaximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector
It is well-known that the maximum exponent that an n-by-n boolean primitive circulant matrix can attain is n− 1. In this paper, we find the maximum exponent that n-by-n boolean primitive circulant matrices with constant number of nonzero entries in its generating vector can attain. We also give matrices attaining such exponents. Solving this problem we also solve two equivalent problems: 1) fin...
متن کاملMaximum Exponent of Boolean Circulant Matrices with Constant Number of Nonzero Entries in their Generating Vector
It is well-known that the maximum exponent that an n-by-n boolean primitive circulant matrix can attain is n − 1. In this paper, we find the maximum exponent attained by n-by-n boolean primitive circulant matrices with constant number of nonzero entries in their generating vector. We also give matrices attaining such exponents. Solving this problem we also solve two equivalent problems: 1) find...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کامل